Retracted: Interpolation Parameters in Inverse Distance-Weighted Interpolation Algorithm on DEM Interpolation Error
نویسندگان
چکیده
منابع مشابه
Spatial Interpolation via Inverse Path Distance Weighting
The R package ipdw provides functions for interpolation of georeferenced point data via Inverse Path Distance Weighting. Useful for coastal marine applications where barriers in the landscape preclude interpolation with Euclidean distances. This method of interpolation requires significant computation and is only practical for relatively small and coarse grids. The ipdw implementation may provi...
متن کاملPresentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کاملInverse B-spline interpolation
B-splines provide an accurate and efficient method for interpolating regularly spaced data. In this paper, I study the applicability of B-spline interpolation in the context of the inverse interpolation method for regularizing irregular data. Numerical tests show that, in comparison with lower-order linear interpolation, B-splines lead to a faster iterative conversion in under-determined proble...
متن کاملInterpolation Theorems on Graph Parameters
For each graph parameter f = f(G) of a graph G, it is said that f interpolates over the set of all graphs with a fixed degree sequence d,R(d) if the following statement holds: If m and M are the minimum and maximum values (respectively) of f(G) over all G ∈ R(d), then for any k, m ≤ k ≤ M, there is a graph G ∈ R(d) such that f(G) = k. In this paper, three graph parameters are shown to be interp...
متن کاملInterpolation with Bounded Error
Given n general points p1, p2, . . . , pn ∈ Pr it is natural to ask whether there is a curve of given degree d and genus g passing through them; by counting dimensions a natural conjecture is that such a curve exists if and only if n ≤ ⌊ (r + 1)d− (r − 3)(g − 1) r − 1 ⌋ . The case of curves with nonspecial hyperplane section was recently studied in [1], where the above conjecture was shown to h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Sensors
سال: 2022
ISSN: ['1687-725X', '1687-7268']
DOI: https://doi.org/10.1155/2022/9842439